Hopcroft's algorithm and tree-like automata
نویسندگان
چکیده
منابع مشابه
TREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS
In this paper, at first we define the concepts of response function and accessible states of a complete residuated lattice-valued (for simplicity we write $mathcal{L}$-valued) tree automaton with a threshold $c.$ Then, related to these concepts, we prove some lemmas and theorems that are applied in considering some decision problems such as finiteness-value and emptiness-value of recognizable t...
متن کاملA Dialectica-Like Approach to Tree Automata
We propose a fibred monoidal closed category of alternating tree automata, based on a Dialectica-like approach to the fibred game model of [17]. Alternating tree automata are equivalent in expressive power to the Monadic Second-Order Logic on infinite trees (MSO), which subsumes most of the logics used in verification (see e.g. [14, 5]). Acceptance of an input tree t by an automaton A can be de...
متن کاملMultidimensional fuzzy finite tree automata
This paper introduces the notion of multidimensional fuzzy finite tree automata (MFFTA) and investigates its closure properties from the area of automata and language theory. MFFTA are a superclass of fuzzy tree automata whose behavior is generalized to adapt to multidimensional fuzzy sets. An MFFTA recognizes a multidimensional fuzzy tree language which is a regular tree language so that for e...
متن کاملAn Algorithm for Composing Pointer Tree Automata
Pointer Tree Automata (PTA's) are a new formalism invented for the ease of data conversion. Each PTA takes an input tree and produces an output tree. The desired format of the data is obtained by a sequence of applications of PTA's. The multiple passes through the data limits the performance of this conversion. In this paper, we describe an algorithm for eliminating this cost by transforming th...
متن کاملA Completion Algorithm for Lattice Tree Automata
When dealing with infinite-state systems, Regular Tree Model Checking approaches may have some difficulties to represent infinite sets of data. We propose Lattice Tree Automata, an extended version of tree automata to represent complex data domains and their related operations in an efficient manner. Moreover, we introduce a new completionbased algorithm for computing the possibly infinite set ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Theoretical Informatics and Applications
سال: 2011
ISSN: 0988-3754,1290-385X
DOI: 10.1051/ita/2011011